Processing Temporal Constraint Networks
نویسندگان
چکیده
This paper describes new algorithms for processing quantitative and qualitative Temporal Constraint Satisfaction Problems (TCSP). In contrast to discrete Constraint Satisfaction Problems (CSP), enforcing path-consistency on quantitative TCSP is exponential, due to the fragmentation problem. Identifying the fragmentation problem allows us to design several e cient polynomial algorithms that are e ective for detecting inconsistencies and explicating some implicit constraints. We discuss the tradeo s between their e ectiveness and e ciency both theoretically and empirically.
منابع مشابه
Series-Parallel and Tree-Decomposition Approaches for Fuzzy Constraint Networks
In this work, we present a Fuzzy Constraint Networks model for discrete domains, which generalizes the Disjunctive Fuzzy Temporal Constraint Networks model for temporal reasoning, and we propose the use of the seriesparallel and tree-decomposition approaches for simplifying its processing. After a separate empirical evaluation process of both techniques, a combined evaluation process over the s...
متن کاملReasoning with Disjunctive Fuzzy Temporal Constraint Networks
The Disjunctive Fuzzy Temporal Constraint Network (DFTCN) model is a framework that allows reasoning with fuzzy qualitative and quantitative complex temporal constraints. However, its general complexity is exponential. In this work, we review methods that can reduce this complexity, based on graph topology and preprocessing. The final goal is to integrate all these methods into a general tool f...
متن کاملCombinin ualitative and Quantitative strai s in Temporal Reasoning*
This paper presents a general model for temporal reasoning, capable of handling both qualita tive and quantitative information. This model allows the representation and processing of all types of constraints considered in the literature so far, including metric constraints (restricting the distance between time points), and qualitative, disjunctive, constraints (specifying the relative position...
متن کاملSimple Stochastic Temporal Constraint Networks
Many artificial intelligence tasks (e.g., planning, situation assessment, scheduling) require reasoning about events in time. Temporal constraint networks offer an elegant and often computationally efficient framework for formulation and solution of such temporal reasoning tasks. Temporal data and knowledge available in some domains is necessarily imprecise e.g., as a result of measurement erro...
متن کاملManaging Dynamic Temporal Constraint Networks
This paper concerns the specialization of arcconsistency algorithms for constraint satisfaction in the management of quantitative temporal constraint networks. Attention is devoted to the design of algorithms that support an incremental style of building solutions allowing both constraint posting and constraint retraction. In particular, the AC-3 algorithm for constraint propagation, customized...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994